A Terminating and Confluent Linear Lambda Calculus
نویسندگان
چکیده
We present a rewriting system for the linear lambda calculus corresponding to the {!, }-fragment of intuitionistic linear logic. This rewriting system is shown to be strongly normalizing, and Church-Rosser modulo the trivial commuting conversion. Thus it provides a simple decision method for the equational theory of the linear lambda calculus. As an application we prove the strong normalization of the simply typed computational lambda calculus by giving a reduction-preserving translation into the linear lambda calculus.
منابع مشابه
Substitution in Lambda Calculus Lecture Notes
We study the formalization of lambda calculus based on De Bruijn terms. The most interesting aspect is a system of substitution primitives and an accompanying equational theory providing for algebraic proofs. The equational theory can be presented as a confluent and terminating rewriting system providing for proof automation. We prove that parallel reduction is strongly substitutive, the key pr...
متن کاملConfluence Results for the Pure Strong Categorical Logic CCL: lambda-Calculi as Subsystems of CCL
The Strong Categorical Combinatory Logic (CCL, CCLpqSP), developed by Curien (1986) is, when typed and augmented with a rule defining a terminal object, a presentation of Cartesian Closed Categories. Furthermore, it is equationally equivalent to the Lambda-calculus with explicit couples and Surjective Pairing. Here we study the confluence properties of (CCL, CCLpqSP) and of several of its subsy...
متن کاملConfluence via strong normalisation in an algebraic lambda-calculus with rewriting
The linear-algebraic λ -calculus and the algebraic λ -calculus are untyped λ -calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while the latter uses equalities. When given by rewrites, algebraic λ -calculi are not confluent unless further restrictions are added. We provide a type system for the linear...
متن کاملToward Isomorphism of Intersection and Union types
This paper investigates type isomorphism in a λ-calculus with intersection and union types. It is known that in λ-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably, invertible terms are linear terms of a particular shape, called finite hereditary permutators. Typing properties of finite hereditary permutators are then studied in a relevan...
متن کاملSeparability of Infinite Lambda Terms
Infinite lambda calculi extend finite lambda calculus with infinite terms and transfinite reduction. In this paper we extend some classical results of finite lambda calculus to infinite terms. The first result we extend to infinite terms is Böhm Theorem which states the separability of two finite βη-normal forms. The second result we extend to infinite terms is the equivalence of the prefix rel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006